A small embedding for partial directed 6k-cycle systems
نویسندگان
چکیده
The main result in this paper is that for m == 0 (mod 6) a partial directed m-cycle system of order n can be embedded in a directed m-cycle system of order less than (mn)/2 + m/2 + 2m + 1. For fixed m, this bound is asymptotic in n to (mn) /2 which is approximately one-half of the best known bound of mn + (0 or 1).
منابع مشابه
A small embedding for large directed even cycle systems
A directed m-cycle system is a collection of directed edges of the form {(XbX2), (X2' X3)(X3, X4), ... , (Xm-l, xm), (xm' xd}, where Xl, X2, X3, ... , Xm are distinct. A partial directed m-cycle system of order n is a pair (8, C), where C is a collection of edge disjoint m-cycles of the complete directed graph Dn with vertex set S. If the cycles in C partition the edge set of Dn we have the def...
متن کاملMaximum Power Point Tracker for Photovoltaic Systems Based on Moth-Flame Optimization Considering Partial Shading Conditions
The performance of photovoltaic (PV) systems is highly dependent on environmental conditions. Due to probable changes in environmental conditions, the real-time control of PV systems is essential for exploiting their maximum possible power. This paper proposes a new method to track the maximum power point of PV systems using the moth-flame optimization algorithm. In this method, the PV DC-DC co...
متن کاملA new small embedding for partial 8-cycle systems
The upper bound for embedding a partial 8-cycle system of order n is improved from 4n + c √ n, c > 0, to 4n + 29.
متن کاملEmbedding partial bipartite directed cycle systems
A 2k-dicycle is a 2k-cycle of a directed bipartite graph and a 2k-dicycle system of order (m,n) is a triple (X, Y,D), where D is a collection of edge disjoint 2k-dicycles which partitions the edge set of the complete directed bipartite graph Dm,n with parts X and Y . A partial 2k-dicycle system of order (s, t) is a triple (S, T, P ), where P is a collection of edge disjoint 2k-dicycles of Ds,t ...
متن کاملSmall embeddings for partial cycle systems of odd length
Let V(G) and E(G) denote the vertex and edge sets of a graph G respectively. Let Z, = (0, 1, . . . , n l}. Let K,, be the complete graph on n vertices. An m-cycle is a simple graph with m vertices, say uo, . . . , u,__~ in which the only edges are uou,_i and the edges joining ui to Ui+l (for 0 s i 6 m 2). We represent this cycle by (uo, . . . , u,_J or (uo, u,_~, u,_~, . . . , ul) or any cyclic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 18 شماره
صفحات -
تاریخ انتشار 1998